A Categorical Representation Language and Computational System for Knowledge-Based Planning

Classical planning representation languages based on first-order logic have been extensively used to model and solve planning problems, but they struggle to capture implicit preconditions and effects that arise in complex planning scenarios. To address this problem, we propose an alternative approach to representing and transforming world states during planning. Based on the category-theoretic concepts of $\mathsf{C}$-sets and double-pushout rewriting (DPO), our proposed representation can effectively handle structured knowledge about world states that support domain abstractions at all levels. It formalizes the semantics of predicates according to a user-provided ontology and preserves the semantics when transitioning between world states. This method provides a formal semantics for using knowledge graphs and relational databases to model world states and updates in planning. In this paper, we compare our category-theoretic representation with the classical planning representation. We show that our proposed representation has advantages over the classical representation in terms of handling implicit preconditions and effects, and provides a more structured framework in which to model and solve planning problems

A neuronal network of mitochondrial dynamics regulates metastasis.

The role of mitochondria in cancer is controversial. Using a genome-wide shRNA screen, we now show that tumours reprogram a network of mitochondrial dynamics operative in neurons, including syntaphilin (SNPH), kinesin KIF5B and GTPase Miro1/2 to localize mitochondria to the cortical cytoskeleton and power the membrane machinery of cell movements. When expressed in tumours, SNPH inhibits the speed and distance travelled by individual mitochondria, suppresses organelle dynamics, and blocks chemotaxis and metastasis, in vivo. Tumour progression in humans is associated with downregulation or loss of SNPH, which correlates with shortened patient survival, increased mitochondrial trafficking to the cortical cytoskeleton, greater membrane dynamics and heightened cell invasion. Therefore, a SNPH network regulates metastatic competence and may provide a therapeutic target in cancer

The META tool optimizes metagenomic analyses across sequencing platforms and classifiers

A major challenge in the field of metagenomics is the selection of the correct combination of sequencing platform and downstream metagenomic analysis algorithm, or “classifier”. Here, we present the Metagenomic Evaluation Tool Analyzer (META), which produces simulated data and facilitates platform and algorithm selection for any given metagenomic use case. META-generated in silico read data are modular, scalable, and reflect user-defined community profiles, while the downstream analysis is done using a variety of metagenomic classifiers. Reported results include information on resource utilization, time-to-answer, and performance. Real-world data can also be analyzed using selected classifiers and results benchmarked against simulations. To test the utility of the META software, simulated data was compared to real-world viral and bacterial metagenomic samples run on four different sequencers and analyzed using 12 metagenomic classifiers. Lastly, we introduce “META Score”: a unified, quantitative value which rates an analytic classifier’s ability to both identify and count taxa in a representative sample

A Categorical Representation Language and Computational System for Knowledge-Based Robotic Task Planning

Classical planning representation languages based on first-order logic have preliminarily been used to model and solve robotic task planning problems. Wider adoption of these representation languages, however, is hindered by the limitations present when managing implicit world changes with concise action models. To address this problem, we propose an alternative approach to representing and managing updates to world states during planning. Based on the category-theoretic concepts of C-sets and double-pushout rewriting (DPO), our proposed representation can effectively handle structured knowledge about world states that support domain abstractions at all levels. It formalizes the semantics of predicates according to a user-provided ontology and preserves the semantics when transitioning between world states. This method provides a formal semantics for using knowledge graphs and relational databases to model world states and updates in planning. In this paper, we conceptually compare our category-theoretic representation with the classical planning representation. We show that our proposed representation has advantages over the classical representation in terms of handling implicit preconditions and effects, and provides a more structured framework in which to model and solve planning problems